in this paper, we propose and analyze an efficient matrix methodbased on bell polynomials for numerically solving nonlinear fredholm- volterraintegral equations. for this aim, first we calculate operational matrix of integration and product based on bell polynomials. by using these matrices, nonlinearfredholm-volterra integral equations reduce to the system of nonlinear algebraicequations which...

In this paper, we propose and analyze an efficient matrix method based on Bell polynomials for numerically solving nonlinear Fredholm- Volterra integral equations. For this aim, first we calculate operational matrix of integration and product based on Bell polynomials. By using these matrices, nonlinear Fredholm-Volterra integral equations reduce to the system of nonlinear algebraic equations w...

In the paper, the author (1) presents an explicit formula and its inversion formula for higher order derivatives of generating functions of the Bell polynomials, with the help of the Faà di Bruno formula, properties of the Bell polynomials of the second kind, and the inversion theorem for the Stirling numbers of the first and second kinds; (2) recovers an explicit formula and its inversion form...

An ordered set-partition (or preferential arrangement) of n labeled elements represents a single “hierarchy”; these are enumerated by the ordered Bell numbers. In this note we determine the number of “hierarchical orderings” or “societies”, where the n elements are first partitioned into m ≤ n subsets and a hierarchy is specified for each subset. We also consider the unlabeled case, where the o...

Our paper deals about identities involving Bell polynomials. Some identities on Bell polynomials derived using generating function and successive derivatives of binomial type sequences. We give some relations between Bell polynomials and binomial type sequences in first part, and, we generalize the results obtained in [4] in second part.

In the paper, using two inversion theorems for the Stirling numbers and binomial coefficients, employing properties of the Bell polynomials of the second kind, and utilizing a higher order derivative formula for the ratio of two differentiable functions, the authors present two explicit formulas, a determinantal expression, and a recursive relation for a sequence of unnamed polynomials, derive ...

We provide an overview of the connections between Bell's inequalities and algebraic structure.

Note that B(n) is the n Bell number while S(n, k) is the Stirling number of the second kind. We have translated Spivey’s notation into Riordan’s familiar notation which we find more preferable in our work [5, 6]. The purpose of this note is to offer a short generating function proof of Equation (1). We discuss this proof in Section 2. We also use Spivey’s formula, in conjunction with the Stirli...

Stirling numbers of the second kind and Bell numbers for graphs were defined by Duncan and Peele in 2009. In a previous paper, one of us, jointly with Nyul, extended the known results for these special numbers by giving new identities, and provided a list of explicit expressions for Stirling numbers of the second kind and Bell numbers for particular graphs. In this work we introduce q-Stirling ...